A survey of top- k query processing techniques in relational database systems
نویسندگان
چکیده
منابع مشابه
Overview of Top-k Query Processing in Relational Databases
Query processing is a fundamental part of Database management system. As the amount of text data stored in relational databases is increasing, it is necessary to support the Top-k query processing over text data. The main objective of top-k query processing is to return the k highest ranked results quickly and efficiently. In this paper, we introduce the Top-k query processing in relational dat...
متن کاملQuery Optimization on Relational Databases for Supporting Top-k Query Processing Techniques
Information systems apply various techniques to rank query answers. Ranking queries (or top-k queries) are dominant in many emerging applications, e.g., similarity queries in multimedia databases, searching web databases, midlewares and data mining. In such application domains, end-users are more interested in the most important (top-k) query answers in the potentially huge answer space. Thus f...
متن کاملProcessing of Top-k Selection Queries in Relational Database System
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typically a rank of the top-k tuples that best match the given attribute values. Focusing on the top-k items according to a ranking criterion constitutes an important functionality in many different query answering scenarios....
متن کاملEfficient Recursive XML Query Processing in Relational Database Systems
Recursive queries are quite important in the context of XML databases. In addition, several recent papers have investigated a relational approach to store XML data and there is growing evidence that schema-conscious approaches are a better option than schema-oblivious techniques as far as query performance is concerned. However, the issue of recursive XML queries for such approaches has not bee...
متن کاملEfficient Early Top-k Query Processing in Overloaded P2P Systems
Top-k query processing in P2P systems has focused on efficiently computing the top-k results while reducing network traffic and query response time. However, in overloaded P2P systems (with very high query loads), some peers may take a long time to answer, thus making the user wait a long time to obtain the final top-k result. In this paper, we address this problem, which we reformulate as earl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Computing Surveys
سال: 2008
ISSN: 0360-0300,1557-7341
DOI: 10.1145/1391729.1391730